THE CONSISTENCY OF ARBITRARILY LARGE SPREAD BETWEEN u AND d
نویسنده
چکیده
As an application of the method used to obtain the result above, we will obtain the consistency of b = ω1 < s = κ where b is the bounding number, s is the splitting number and κ is an arbitrary regular cardinal. Suppose ν ≥ δ. Begin with a model of GCH and adjoin δ-many Cohen reals 〈rα : α ∈ δ〉 followed by ν-many Random reals 〈sξ : ξ ∈ ν〉. That is, if Vδ is the model obtained after the first δ Cohen reals, the generic extension in which we are interested is obtained by finite support iteration of length ν of Random real forcing over Vδ. Since random forcing is ω-bounding, the Cohen reals remain a dominating family in the final generic extension Vδ,ν . Furthermore for any family of reals of size smaller than δ there is a Cohen real which is unbounded by this family, and so Vδ,ν d = δ. To verify that u = ν, recall that if a is random real over some model M , then neither a, no ω−a contains infinite sets from M . Again since the ground model V satisfies GCH and the forcing notions with which we work have the countable chain condition, any set of reals A in Vδ,ν of size smaller than ν is obtained at some initial stage of the random real forcing iteration Vδ,α for some α < ν. But then neither sα nor ω − sα contains an element of A and so A does not generate an ultrafilter. Therefore u = c = ν.
منابع مشابه
Reciprocal Degree Distance of Grassmann Graphs
Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.
متن کاملUniquely D-colourable Digraphs with Large Girth
Let C and D be digraphs. A mapping f : V (D) → V (C) is a Ccolouring if for every arc uv of D, either f(u)f(v) is an arc of C or f(u) = f(v), and the preimage of every vertex of C induces an acyclic subdigraph in D. We say that D is C-colourable if it admits a C-colouring and that D is uniquely Ccolourable if it is surjectively C-colourable and any two C-colourings of D differ by an automorphis...
متن کاملابررسانای d- موجی، پادفرومغناطیس و مایع اسپینی در ابررساناهای آلی شبه دوبعدی
The self-energy-functional approach is a powerful many-body tool to investigate different broken symmetry phases of strongly correlated electron systems. We use the variational cluster perturbation theory (also called the variational cluster approximation) to investigate the interplay between the antiferromagnetism and d-wave superconductivity of κ-(ET)2 X conductors. These compounds are desc...
متن کاملThe Hyper-Wiener Polynomial of Graphs
The distance $d(u,v)$ between two vertices $u$ and $v$ of a graph $G$ is equal to the length of a shortest path that connects $u$ and $v$. Define $WW(G,x) = 1/2sum_{{ a,b } subseteq V(G)}x^{d(a,b) + d^2(a,b)}$, where $d(G)$ is the greatest distance between any two vertices. In this paper the hyper-Wiener polynomials of the Cartesian product, composition, join and disjunction of graphs are compu...
متن کاملZagreb, multiplicative Zagreb Indices and Coindices of graphs
Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The first, second and third Zagreb indices of G are respectivly defined by: $M_1(G)=sum_{uin V} d(u)^2, hspace {.1 cm} M_2(G)=sum_{uvin E} d(u).d(v)$ and $ M_3(G)=sum_{uvin E}| d(u)-d(v)| $ , where d(u) is the degree of vertex u in G and uv is an edge of G connecting the vertices u and v. Recently, the first and second m...
متن کامل